Randomized algorithms

Results: 419



#Item
141Probabilistic complexity theory / Randomized algorithm / Logarithm / Applied mathematics / Computational complexity theory / Errors-in-variables models / Normal distribution / Theoretical computer science / Mathematics / Analysis of algorithms

 Exercise 1 (A streaming algorithm for the second moment of the frequencies). We are given a stream of numbers x1 , . . . , xn ∈ {0, . . . , m − 1} and we want to compute the sum of the squares of the frequencies of

Add to Reading List

Source URL: www.liafa.univ-paris-diderot.fr

Language: English - Date: 2015-01-19 07:51:43
142Analysis of algorithms / Probabilistic complexity theory / Randomized algorithm / Consensus / Algorithm / Time complexity / Adversary model / Logarithm / Theoretical computer science / Computational complexity theory / Applied mathematics

Sub-Logarithmic Test-and-Set Against a Weak Adversary? Dan Alistarh1 and James Aspnes2 1 2

Add to Reading List

Source URL: cs-www.cs.yale.edu

Language: English - Date: 2015-04-30 10:33:59
143Normal distribution / Applied mathematics / Probability and statistics / Statistics / Analysis of algorithms / Probabilistic complexity theory / Randomized algorithm

Approximation Algorithms for Unique Games via Orthogonal Separators Lecture notes by Konstantin Makarychev. Lecture notes are based on the papers [CMM06a, CMM06b, LM14]. 1

Add to Reading List

Source URL: konstantin.makarychev.net

Language: English - Date: 2014-11-22 21:53:55
144Applied mathematics / Hashing / Randomized algorithm / Method of conditional probabilities / Universal hashing / Chernoff bound / Tabulation hashing / Random walk / Algorithm / Search algorithms / Mathematics / Theoretical computer science

Notes on Randomized Algorithms CS: Fall 2014 James Aspnes:04

Add to Reading List

Source URL: cs.yale.edu

Language: English - Date: 2014-12-17 20:04:41
145NP-complete problems / Analysis of algorithms / Graph coloring / Graph theory / Time complexity / Boolean satisfiability problem / Randomized algorithm / MAXEkSAT / One-in-three 3SAT / Theoretical computer science / Computational complexity theory / Mathematics

Algorithms Lecture 4: Efficient Exponential-Time Algorithms [Fa’14] Wouldn’t the sentence “I want to put a hyphen between the words Fish and And and And and Chips in my Fish-And-Chips sign.” have been clearer if

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:02:22
146Analysis of algorithms / Sorting algorithms / Computational complexity theory / Time complexity / Decision tree model / Binary search algorithm / Algorithm / Randomized algorithm / Quicksort / Theoretical computer science / Mathematics / Applied mathematics

Algorithms Lecture 28: Lower Bounds [Fa’13] It was a Game called Yes and No, where Scrooge’s nephew had to think of something, and the rest must find out what; he only answering to their questions yes or no, as the

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:03:15
147Sorting algorithms / Combinatorics / Permutations / Randomness / Quicksort / Randomized algorithm / Merge sort / Algorithm / Time complexity / Mathematics / Theoretical computer science / Analysis of algorithms

Randomization Algorithms Lecture 9: Randomized Algorithms [Sp’15]

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 08:41:39
148Probabilistic complexity theory / Randomized algorithm / Outlier / Algorithm / RANSAC / CURE data clustering algorithm / Statistics / Robust statistics / Analysis of algorithms

CCCG 2013, Waterloo, Ontario, August 8–10, 2013 How to Cover Most of a Point Set with a V-Shape of Minimum Width Boris Aronov∗

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2013-08-11 21:51:58
149Analysis of algorithms / Fault-tolerant computer systems / Probabilistic complexity theory / Consensus / Randomized algorithm / Distributed algorithm / Factorial / IP / Time complexity / Theoretical computer science / Computational complexity theory / Mathematics

Distributed Agreement with Optimal Communication Complexity Seth Gilbert EPFL Abstract We consider the problem of fault-tolerant agreement in

Add to Reading List

Source URL: www.comp.nus.edu.sg

Language: English - Date: 2009-11-24 09:45:55
UPDATE